Automatikos terminų žodynas. – Vilnius: Technika. Vilius Antanas Geleževičius, Angelė Kaulakienė, Stanislovas Marcinkevičius. 2004.
automaton — [ô täm′ə tän΄, ô täm′ətən] n. pl. automatons or automata [ô täm′ətə] [L < Gr, neut. of automatos: see AUTOMATIC] 1. anything that can move or act of itself 2. an apparatus that automatically performs certain actions by responding to preset… … English World dictionary
Automaton — This article is about a self operating machine. For other uses of Automaton, see Automaton (disambiguation) or Automata (disambiguation). An automaton (plural: automata or automatons ) is a self operating machine. The word is sometimes used to… … Wikipedia
Automaton Transfusion — Infobox Film name = Automaton Transfusion caption = director = Steven C Miller producer = Adam Goldworm (Executive Producer) writer = Steven C Miller starring = Garrett Jones Juliet Reeves William Howard Bowman music = cinematography = editing =… … Wikipedia
automaton — noun (plural atons or automata) Etymology: Latin, from Greek, neuter of automatos Date: 1645 1. a mechanism that is relatively self operating; especially robot 2. a machine or control mechanism designed to follow … New Collegiate Dictionary
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
ω-automaton — In automata theory, a branch of theoretical computer science, an ω automaton (or stream automaton) is a deterministic or nondeterministic automaton that runs on infinite, rather than finite, strings as input. Since ω automata do not stop, they… … Wikipedia
Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia
Permutation automaton — In automata theory, a permutation automaton, or pure group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states.[1][2] Formally, a deterministic finite automaton A may be defined by the tuple (S, I … Wikipedia
Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves … Wikipedia
Hybrid automaton — A hybrid automaton (plural hybrid automata) is a mathematical model for precisely describing systems where computational processes interact with physical processes. Its behavior consists of discrete state transitions and continuous… … Wikipedia
